An integer L-shaped algorithm for the integrated location and network restoration problem in disaster relief
نویسندگان
چکیده
Being prepared for potential disaster scenarios enables government agencies and humanitarian organizations to respond effectively once the hits. In literature, two-stage stochastic programming models are commonly employed develop preparedness plans before anticipated disasters. These can be very difficult solve as complexity increases with several sources of uncertainty interdependent decisions. this study, we propose an integer L-shaped algorithm integrated location network restoration model, which is a model determining number locations emergency response facilities resources under uncertainty. Our accommodates second-stage binary decision variables required indicate undamaged restored roads that used relief distribution. computational results show our outperforms CPLEX larger solution time only linearly increases.
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولAn integer L-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delays
This paper considers a single-vehicle Dial-a-Ride problem in which customers may experience stochastic delays at their pickup locations. If a customer is absent when the vehicle serves the pickup location, the request is fulfilled by an alternative service (e.g., a taxi) whose cost is added to the total cost of the tour. In this case, the vehicle skips the corresponding delivery location, which...
متن کاملAn Integrated Approach for Reliable Facility Location/Network Design Problem with Link Disruption
Proposing a robust designed facility location is one of the most effective ways to hedge against unexpected disruptions and failures in a transportation network system. This paper considers the combined facility location/network design problem with regard to transportation link disruptions and develops a mixed integer linear programming formulation to model it. With respect to the probability o...
متن کاملAn Imperialist Competitive Algorithm and a Mixed Integer Programming Formulation for the Capacitated Vehicle Routing Problem
The Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and t...
متن کاملDisaster Relief: an Industrial Engineering Problem
University of Pittsburgh, Swanson School of Engineering 11.01.2016 1 Disclaimer—This paper partially fulfills a writing requirement for first year (freshman) engineering students at the University of Pittsburgh Swanson School of Engineering. This paper is a student, not a professional, paper. This paper is based on publicly available information and may not provide complete analyses of all rele...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Part B-methodological
سال: 2021
ISSN: ['1879-2367', '0191-2615']
DOI: https://doi.org/10.1016/j.trb.2021.01.005